Linear Authentication Codes from Free Modules: Bounds and Constructions
نویسنده
چکیده
In this paper, we principally introduce a new class of unconditionally secure authentication codes, called linear authentication codes(or linear A-codes)from free modules. We then derive an upper bound on the size of source space when other parameters of the system, that is, the sizes of the key space and authenticator space, and the deception probability are fixed. We give constructions that are asymptotically close to the bound and show applications of these codes in constructing distributed authentication systems. We realize the generalization of linear authentication codes from vector space over field to free modules over ring. Key–Words: Authentication codes(A-codes), Distributed A-codes, Multi-receiver A-codes, Multi-sender A-codes, Free modules, Ring
منابع مشابه
Three Constructions of Authentication/Secrecy Codes
In this paper, we present three algebraic constructions of authentication codes with secrecy. The codes have simple algebraic structures and are easy to implement. They are asymptotically optimal with respect to certain bounds. © 2004 Elsevier B.V. All rights reserved. MSC: Primary: 94-02; secondary: 94A60; 94A62; 11T71
متن کاملAuthentication codes from generalized quadrangles
Authentication codes were introduced by Simmons in [3]. Many combinatorial structures can be used to construct authentication codes, and interesting combinatorial bounds can be obtained, see e.g. [7], [8] and [9]. We investigate authentication codes arising from generalized quadrangles (GQs), which was first done in [1]. The use of intricated techniques and constructions from the theory of GQs ...
متن کاملMultireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal dee-nition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient and exible constructions ...
متن کاملTight Bounds for Keyed Sponges and Truncated CBC
We prove (nearly) tight bounds on the concrete PRF-security of two constructions of message-authentication codes (MACs): (1) The truncated CBC-MAC construction, which operates as plain CBC-MAC (without prefix-free encoding of messages), but only returns a subset of the output bits. (2) The MAC derived from the sponge hash-function family by pre-pending a key to the message, which is the de-fact...
متن کاملBounds and Constructions for Multireceiver Authentication Codes
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal deenition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient constructions for such cod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013